A method of sequential log-convex programming for engineering design

Abstract A method of Sequential Log-Convex Programming (SLCP) is constructed that exploits the log-convex structure present in many engineering design problems. The mathematical Geometric (GP) combined with ability Quadratic Program (SQP) to accommodate a wide range objective and constraint functions, resulting practical algorithm can be adopted little no modification existing practices. Three test problems are considered demonstrate SLCP algorithm, comparing it SQP modified Logspace (LSQP). In these cases, shows up 77% reduction number iterations compared SQP, an 11% LSQP. airfoil analysis code XFOIL integrated into one case studies show how used evolve fidelity have initially been modeled as GP compatible. Finally, methodology for based on briefly discussed.